Applications of the Inverse Theta Number in Stable Set Problems

نویسنده

  • Miklós Ujvári
چکیده

Recently the author introduced a semidefinite upper bound on the square of the stability number of a graph, the inverse theta number, which is proved here to be multiplicative with respect to the strong graph product, hence to be an upper bound for the square of the Shannon capacity of the graph. We also describe a heuristic algorithm for the stable set problem based on semidefinite programming, Cholesky factorization, and eigenvector computation. Mathematics Subject Classifications (2000). 90C22, 90C27

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ill-Posed and Linear Inverse Problems

In this paper ill-posed linear inverse problems that arises in many applications is considered. The instability of special kind of these problems and it's relation to the kernel, is described. For finding a stable solution to these problems we need some kind of regularization that is presented. The results have been applied for a singular equation.

متن کامل

A STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$-TH ROOT

The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iter...

متن کامل

On End and Coupled Endpoints of $theta$-$F$-Contractive Set-Valued ‎Mappings‎

In this paper, we introduce a new concept in set-valued mappings which we have called condition $(UHS)$. Then, adding this condition to a new type of contractive set-valued mappings, recently has been introduced by Amini-Harandi [Fixed and coupled fixed points of a new type contractive set-valued mapping in complete metric spaces, Fixed point theory and applications, 215 (2012)], we prove that ...

متن کامل

A novel computational procedure based on league championship algorithm for solving an inverse heat conduction problem

Inverse heat conduction problems, which are one of the most important groups of problems, are often ill-posed and complicated problems, and their optimization process has lots of local extrema. This paper provides a novel computational procedure based on finite differences method and league championship algorithm to solve a one-dimensional inverse heat conduction problem. At the beginning, we u...

متن کامل

Linkage factors optimization of Multi-outputs of compliant mechanism using Response Surface

This paper presents a linkage factors synthesis and multi-level optimization technique for bi-stable compliant mechanism. The linkage synthesis problem is modeled as multiple level factors and responses optimization problem with constraints. The bi-stable compliant mechanism is modeled as a crank slider mechanism using pseudo-rigid-body model (PRBM). The model exerts the large deflection of fle...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Acta Cybern.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2014